Another proof of undecidability for the correspondence decision problem - Had I been Emil Post
نویسنده
چکیده
In 1946 Emil Leon Post (Bulletin of Amer. Math. Soc. 52 (1946), 264 – 268) defined a famous correspondence decision problem which is nowadays called the Post Correspondence Problem, and he proved that the problem is undecidable. In this article we follow the steps of Post, and give another, simpler and more straightforward proof of the undecidability of the problem using the same source of reduction as Post original did, namely, the Post Normal Systems.
منابع مشابه
Randomized algorithm approach for solving PCP
Post Correspondence Problem is an undecidable problem that was introduced by Emil Post and is often used in proofs of undecidability. No efficient nondeterministic solution to the problem exists. The paper intends to present a nondeterministic solution to the above problem. The proposed work has been tested for some constrained inputs and the results were encouraging. The paper also discusses t...
متن کاملUndecidability of Plane Polygonal Mereotopology
This paper presents a mereotopological model of polygonal regions of the Euclidean plane and an undecidability proof of its rst-order theory. Restricted to the primitive operations the model is a Boolean algebra. Its single primitive predicate deenes simple polygons as the topologically simplest poly-gonal regions. It turns out that both the relations usually provided by mereotopolo-gies and mo...
متن کاملFinite Substitutions and Integer Weighted Finite Automata
In this work we present a new chain of undecidability reductions, which begins from the classical halting problem of Turing machines and ends to the undecidability proof of the equivalence problem for nite substitutions on regular languages in Chapter 4. This undecidability result was originally proved by L. Lisovik in 1997. We present a new proof, which is shorter and more elementary than the ...
متن کاملUndecidability Bounds for Integer Matrices Using Claus Instances
There are several known undecidability problems for 3×3 integer matrices the proof of which uses a reduction from the Post Correspondence Problem (PCP). We establish new lower bounds in the numbers of matrices for the mortality, zero in left upper corner, vector reachability, matrix reachability, scaler reachability and freeness problems. Also, we give a short proof for a strengthened result du...
متن کاملUndecidability of Infinite Post Correspondence Problem for Instances
In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem was shown to be undecidable by Ruohonen (1985) in general. Recently Blondel and Canterini (Theory Comput. Syst. 36 (2003) 231–245) showed that this problem is undecidable for domain al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1411.5197 شماره
صفحات -
تاریخ انتشار 2014